A better subgraph of the minimum weight triangulationBO-TING YANG.Information processing letters. 1995, Vol 56, Num 5, pp 255-258, issn 0020-0190Article

Classification of Harish-Chandra modules over the Virasoro Lie algebraMATHIEU, O.Inventiones mathematicae. 1992, Vol 107, Num 2, pp 225-234, issn 0020-9910Article

Minimum-weight spanning tree construction in O(log log n) communication roundsLOTKER, Zvi; PATT-SHAMIR, Boaz; PAVLOV, Elan et al.SIAM journal on computing (Print). 2006, Vol 35, Num 1, pp 120-131, issn 0097-5397, 12 p.Article

Unique response Roman domination in graphsEBRAHIMI TARGHI, E; JAFARI RAD, N; VOLKMANN, L et al.Discrete applied mathematics. 2011, Vol 159, Num 11, pp 1110-1117, issn 0166-218X, 8 p.Article

A note on Roman domination in graphsXING, Hua-Ming; XIN CHEN; CHEN, Xue-Gang et al.Discrete mathematics. 2006, Vol 306, Num 24, pp 3338-3340, issn 0012-365X, 3 p.Article

Total minus domination in k-partite graphsLIYING KANG; SHAN, Erfang; CACCETTA, Louis et al.Discrete mathematics. 2006, Vol 306, Num 15, pp 1771-1775, issn 0012-365X, 5 p.Article

Construction of optimal ternary constant weight codes via Bhaskar Rao designsGE, Gennian.Discrete mathematics. 2008, Vol 308, Num 13, pp 2704-2708, issn 0012-365X, 5 p.Article

Tight lower bounds for minimum weight triangulation heuristicsLEVCOPOULOS, C; KRZNARIC, D.Information processing letters. 1996, Vol 57, Num 3, pp 129-135, issn 0020-0190Article

A new type of edge-derived vertex coloringGYORI, Ervin; PALMER, Cory.Discrete mathematics. 2009, Vol 309, Num 22, pp 6344-6352, issn 0012-365X, 9 p.Conference Paper

Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weightFERENCOVA, Barbora; MADARAS, Tomáš.Discrete mathematics. 2010, Vol 310, Num 12, pp 1661-1675, issn 0012-365X, 15 p.Article

The Steiner tree problem on graphs : Inapproximability resultsCHLEBIK, Miroslav; CHLEBIKOVA, Janka.Theoretical computer science. 2008, Vol 406, Num 3, pp 207-214, issn 0304-3975, 8 p.Article

2-Change for k-connected networksGOEMANS, M. X; TALLURI, K. T.Operations research letters. 1991, Vol 10, Num 2, pp 113-117, issn 0167-6377Article

PRACTICAL APPLICATION OF A SAMPLING INVARIANT FOR DETERMINING THE MINIMUM WEIGH OF A SAMPLE FOR ASSAYINGGOROKHOD I YU.1982; FIZ.-TEH. PROBL. RAZRAB. POLEZN. ISKOP.; ISSN 0015-3273; SUN; DA. 1982; NO 4; PP. 101-110; BIBL. 3 REF.Article

A lower bound for approximating the geometric minimum weight matchingDAS, G; SMID, M.Information processing letters. 2000, Vol 74, Num 5-6, pp 253-255, issn 0020-0190Article

Approximating the weight of shallow Steiner treesKORTSARZ, G; PELEG, D.Discrete applied mathematics. 1999, Vol 93, Num 2-3, pp 265-285, issn 0166-218XArticle

A dual approximation approach to weighted matroid intersectionSHIGENO, M; IWATA, S.Operations research letters. 1995, Vol 18, Num 3, pp 153-156, issn 0167-6377Article

DETERMINATION OF THE MINIMUM WEIGH OF A SAMPLE FOR THE ANALYSIS OF THE QUALITATIVE COMPOSITIONGIBELEV EI.1978; IZVEST. VYSSH. UCHEBN. ZAVED., GORN. ZH.; SUN; DA. 1978; VOL. 21; NO 5; PP. 162-164; BIBL. 4 REF.Article

Fault-tolerant routing: k-inconnected many-to-one routing in wireless networksDEYING LI; YUEXUAN WANG; QINGHUA ZHU et al.Theoretical computer science. 2011, Vol 412, Num 3, pp 209-216, issn 0304-3975, 8 p.Article

ESTIMATING THE WEIGHT OF METRIC MINIMUM SPANNING TREES IN SUBLINEAR TIMECZUMAJ, Artur; SOHLER, Christian.SIAM journal on computing (Print). 2010, Vol 39, Num 3, pp 904-922, issn 0097-5397, 19 p.Article

A 5 + ∈-approximation algorithm for minimum weighted dominating set in unit disk graphDECHENG DAI; CHANGYUAN YU.Theoretical computer science. 2009, Vol 410, Num 8-10, pp 756-765, issn 0304-3975, 10 p.Article

Efficient computation of 2-medians in a tree network with positive/negative weightsBENKOCZI, Robert; BHATTACHARYA, B. K; BRETON, D et al.Discrete mathematics. 2006, Vol 306, Num 14, pp 1505-1516, issn 0012-365X, 12 p.Conference Paper

Approximating the minimum weight weak vertex covertYONG ZHANG; QI GE; FLEISCHE, Rudolf et al.Theoretical computer science. 2006, Vol 363, Num 1, pp 99-105, issn 0304-3975, 7 p.Article

On the hardness of finding near-optimal multicuts in directed acyclic graphsBENTZ, Cédric.Theoretical computer science. 2011, Vol 412, Num 39, pp 5325-5332, issn 0304-3975, 8 p.Article

The complexity of the weight problem for permutation and matrix groupsCAMERON, Peter J; TAOYANG WU.Discrete mathematics. 2010, Vol 310, Num 3, pp 408-416, issn 0012-365X, 9 p.Conference Paper

A simple algorithm for multicuts in planar graphs with outer terminalsBENTZ, Cédric.Discrete applied mathematics. 2009, Vol 157, Num 8, pp 1959-1964, issn 0166-218X, 6 p.Article